Meta-heuristic Method for the Single Source Capacitated Facility Location Problem
نویسندگان
چکیده
منابع مشابه
A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
This paper presents a very large scale neighborhood (VLSN) search algorithm for the capacitated facility location problem with single-source constraints. The neighborhood structures are induced by customer multi-exchanges and by facility moves. We consider both single-customer multi-exchanges, detected on a suitably de ned customer improvement graph, and multi-customer multi-exchanges, detected...
متن کاملAn exact method for the two-echelon, single-source, capacitated facility location problem
Facility location problems form an important class of integer programming problems, with applications in the telecommunication, distribution and transportation industries. In this paper we are concerned with a particular type of facility location problem in which there exist two echelons of facilities. Each facility in the second echelon has limited capacity and can be supplied by only one faci...
متن کاملThree Meta-heuristic Algorithms for the Single-item Capacitated Lot-sizing Problem (RESEARCH NOTE)
This paper proposes a mixed integer programming model for single-item capacitated lot-sizing problem with setup times, safety stock, demand shortages, outsourcing and inventory capacity. Due to the complexity of problem, three meta-heuristics algorithms named simulated annealing (SA), vibration damping optimization (VDO) and harmony search (HS) have been used to solve this model. Additionally, ...
متن کاملa hybrid meta-heuristic approach for the capacitated location-routing problem with hard time windows
the capacitated location-routing problem (clrp) is a new research area in logistics and distribution management. this problem combines two difficult problems: the facility location problem (flp) and vehicle routing problem (vrp). the goal of the clrp is to open a subset of depots, assign the customers into open facilities, and then design vehicle tours in order to minimize the total cost. the t...
متن کاملA computational study of dicut reformulation for the Single Source Capacitated Facility Location problem
The Capacitated Facility Location Problem is to locate a set of facilities with capacity constraints, with the aim of satisfying at the minimum cost the demands of a set of clients. The Single Source version (SingleCFLP ) of the problem has the additional requirement that each client must be assigned to a single facility. In this paper a reformulation of the problem based on Dicut Inequalities ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Korea Contents Association
سال: 2010
ISSN: 1598-4877
DOI: 10.5392/jkca.2010.10.9.107